CSP Search with Responsibility Sets and Kernels
نویسندگان
چکیده
We introduce data structures called responsibility set and kernel. We present an algorithm FCRK, which is a modification of FC that maintains these structures and uses them for pruning of the search space. According to our experimental evaluation, FC-RK outperforms FC-CBJ on constraint networks encoding graph k-coloring instances and on non-dense random binary constraint networks.
منابع مشابه
CSP Search Algorithms with Responsibility Sets and Kernels
A CSP lookahead search algorithm, like FC or MAC, explores a search tree during its run. Every node of the search tree can be associated with a CSP created by the refined domains of unassigned variables. If the algorithm detects that the CSP associated with a node is insoluble, the node becomes a dead-end. A strategy of pruning ”by analogy” states that the current node of the search tree can be...
متن کاملTIME-VARYING FUZZY SETS BASED ON A GAUSSIAN MEMBERSHIP FUNCTIONS FOR DEVELOPING FUZZY CONTROLLER
The paper presents a novel type of fuzzy sets, called time-Varying Fuzzy Sets (VFS). These fuzzy sets are based on the Gaussian membership functions, they are depended on the error and they are characterized by the displacement of the kernels to both right and left side of the universe of discourse, the two extremes kernels of the universe are fixed for all time. In this work we focus only on t...
متن کاملEnsemble Kernel Learning Model for Prediction of Time Series Based on the Support Vector Regression and Meta Heuristic Search
In this paper, a method for predicting time series is presented. Time series prediction is a process which predicted future system values based on information obtained from past and present data points. Time series prediction models are widely used in various fields of engineering, economics, etc. The main purpose of using different models for time series prediction is to make the forecast with...
متن کاملA Decomposition Technique for CSPs Using Maximal Independent Sets and Its Integration with Local Search
We introduce INDSET, a technique for decomposing a Constraint Satisfaction Problem (CSP) by identifying a maximal independent set in the constraint graph of the CSP. We argue that this technique reduces the complexity of solving the CSP exponentially by the size of the maximal independent set, and yields compact and robust solutions. We discuss how to integrate this decomposition technique with...
متن کاملAn Implementation and Analysis of a Kernel Network Stack in Go with the CSP Style
Modern operating system kernels are written in lower level languages such as C. Although the low level functionalities of C are often useful within kernels, they also give rise to several classes of bugs. Kernels written in higher level languages avoid many of these potential problems, at the possible cost of decreased performance. This research evaluates the advantages and disadvantages of a k...
متن کامل